Enabling Quasi-Static Reconfigurable Networks With Robust Topology Engineering

نویسندگان

چکیده

Many optical circuit switched data center networks (DCN) have been proposed in the last decade to attain higher capacity and topology reconfigurability, though commercial adoption of these architectures minimal. One major challenge face is difficulty handling uncertain traffic demands using switches (OCS) with high switching latency. Prior works generally focused on developing fast-switching OCS prototypes quickly react variations through frequent reconfigurations. This approach, however, adds tremendous complexity overhead control plane, raises barrier for networks. We propose, a robust routing optimization framework reconfigurable centers. co-optimizes based convex set matrices, offers strict throughput guarantees any future matrices bounded by set. For bursty that are unbounded set, we employ desensitization technique reduce performance hit. enables generate solutions capable unexpected changes without relying Our extensive evaluations Facebook’s production DCN traces show that, even daily reconfigurations which could be realized current MEMS-based OCSs from Calient Technologies, achieves about 20% lower max link utilization, 32% average hop count compared cost-equivalent static topologies. work shows topologies DCNs feasible fast OCSs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Topology Representing Networks

Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link is created between the first and second closest units to each datum, creating a graph which preserves the topology of the data set. However, one has to deal with finite data distributions generally corrupted with noise,...

متن کامل

Quasi-Static Scheduling of Reconfigurable Dataflow Graphs for DSP Systems

Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools are limited in their ability to effectively handle dynamic application behavior. In this paper, we develop efficient quasi-static scheduling techniques for a broad class of dynamically-reconfigurable dataflow specific...

متن کامل

Static analysis of topology-dependent broadcast networks

Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast networks have focused on fixed connectivities, but this is unsuitable in the case of wireless networks where the dynamically changing network topology is a crucial ingredient. In this paper we develop a static analysis that ...

متن کامل

University of Alberta Topology Design for Reconfigurable ATM Networks

ATM is recornmended as the preferred transfer mode to support multimedia services in B-ISDN. The logical VP based network provides an effective way to facili tate the dynarnic resource management in ATM networks. The physical topology of a n ATM network should be designed to provide flexibility to the logical VP reconfiguration in order to adapt to changing traffic conditions and possible netwo...

متن کامل

Quasi-Static Numerical Simulation of Missile Staging

In this study, the missile staging process by implementing a side-injected jet is simulated numerically. The problem is considered to be axisymmetric and the thin shear layer approximation of Navier-Stokes equations along with an algebraic turbulence model is used in a quasi-static form for the calculations. The free stream corresponds to a very high altitude flight condition with a Mach number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE ACM Transactions on Networking

سال: 2023

ISSN: ['1063-6692', '1558-2566']

DOI: https://doi.org/10.1109/tnet.2022.3210534